Back to course home
0% completed
Vote For New Content
Microsoft Hard Problems
Regular Expression Matching (hard)
Solution: Regular Expression Matching
First Missing Positive (hard)
Solution: First Missing Positive
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Sliding Window Maximum (hard)
Solution: Sliding Window Maximum
Count Unique Characters of All Substrings of a Given String (hard)
Solution: Count Unique Characters of All Substrings of a Given String
Word Ladder (hard)
Solution: Word Ladder
Word Ladder II (hard)
Solution: Word Ladder II
Number of Flowers in Full Bloom (hard)
Solution: Number of Flowers in Full Bloom
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Multiply Strings (medium)
Problem Statement
Given two non-negative numbers num1 and num2 represented as strings, return the multiplication of num1 and num2 , represented as a string.
Examples
-
Example 1:
- Input: num1:
4, num2:5 - Expected Output: "20"
- Justification: Multiplying 4 by 5 gives 20, showcasing simple multiplication.
- Input: num1:
-
Example 2:
- Input: num1:
11, num2:11 - Expected Output: "121"
- Justification: The multiplication of 11 by 11 equals 121.
- Input: num1:
-
Example 3:
- Input: num1:
999, num2:999 - Expected Output: "998001"
- Justification: The multiplication of 999 by 999 equals 998001.
- Input: num1:
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Maximum Level Sum of a Binary Tree
Solution: Multiply Strings
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself